Generating $I$-Eigenvalue Free Threshold Graphs
نویسندگان
چکیده
A graph is said to be $I$-eigenvalue free if it has no eigenvalues in the interval $I$ with respect adjacency matrix $A$. In this paper we present twoalgorithms for generating threshold graphs.
منابع مشابه
On Generating Triangle-Free Graphs
We show that the problem to decide whether a graph can be made triangle-free with at most k edge deletions remains NP-complete even when restricted to planar graphs of maximum degree seven. In addition, we provide polynomial-time data reduction rules for this problem and obtain problem kernels consisting of 6k vertices for general graphs and 11k/3 vertices for planar graphs.
متن کاملEigenvalue distribution in scale free graphs
Scale free graphs can be found very often as models of real networks and are characterized by a power law degree distribution, that is, for a constant γ ≥ 1 the number of vertices of degree d is proportional to d−γ . Experimental studies show that the eigenvalue distribution also follows a power law for the highest eigenvalues. Hence it has been conjectured that the power law of the degrees det...
متن کاملThe smallest eigenvalue of Kr-free graphs
Let G be a Kr+1-free graph with n vertices and m edges, and let n (G) be the smallest eigenvalue of its adjacency matrix. We show that
متن کاملAn Algorithm Generating Scale Free Graphs
We propose a simple random process inducing various types of random graphs and the scale free random graphs among others. The model is of a threshold nature and differs from the preferential attachment approach discussed in the literature before. The degree statistics of a random graph in our model is governed by the control parameter η stirring the pure exponential statistics for the degree di...
متن کاملClaw-free graphs. I. Orientable prismatic graphs
A graph is prismatic if for every triangle T , every vertex not in T has exactly one neighbour in T . In this paper and the next in this series, we prove a structure theorem describing all prismatic graphs. This breaks into two cases depending whether the graph is 3-colourable or not, and in this paper we handle the 3-colourable case. (Indeed we handle a slight generalization of being 3-coloura...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Combinatorics
سال: 2023
ISSN: ['1077-8926', '1097-1440']
DOI: https://doi.org/10.37236/11225